Multiple Objective Step Function Maximization with Genetic Algorithms and Simulated Annealing
نویسندگان
چکیده
منابع مشابه
Comparison of Simulated Annealing, Genetic, and Tabu Search Algorithms for Fracture Network Modeling
The mathematical modeling of fracture networks is critical for the exploration and development of natural resources. Fractures can help the production of petroleum, water, and geothermal energy. They also greatly influence the drainage and production of methane gas from coal beds. Orientation and spatial distribution of fractures in rocks are important factors in controlling fluid flow. The obj...
متن کاملSystem Identification and Linearisation Using Genetic Algorithms with Simulated Annealing
This paper develops high performance system identification and linearisation techniques, using a genetic algorithm. The algorithm is fine tuned by simulated annealing, which yields a faster convergence and a more accurate search. This global search technique is used to identify the parameters of a system described by an ARMAX model in the presence of white noise and to approximate a nonlinear m...
متن کاملSolving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods
This paper presents the investigation of an evolutionary multi-objective simulated annealing algorithm with variable neighborhoods to solve the multi-objective multicast routing problems in telecommunications. The hybrid algorithm aims to carry out a more flexible and adaptive exploration in the complex search space by using features of the variable neighborhood search to find more non-dominate...
متن کاملSimulated Annealing and Genetic Algorithms for Shape Detection
The paper presents three heuristical methods for the solution of the shape detection problem. This problem arises in a large number of applications and is therefore of large interest to develop eeective methods for its solution. We formulate the shape detection problem as a combinatorial optimization problem and use methods based on simulated annealing and genetic algorithms for its solution. T...
متن کاملGenetic Algorithms and Simulated Annealing: A Marriage Proposal
Cenetic Algorithms (CA) and Slmulated Annealing (SA) have emerged as the leadlng methodologies for search and optimization problems in high dlmensional spaces. Previous attempts at hybrkllzing these two algorithms have been cumbersome and requlred major changes to both. In this paper we propose a simple scheme of using Simulated-Annealing Mutation (SAM) and Recombination (SAR) as operators In a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2003
ISSN: 1556-5068
DOI: 10.2139/ssrn.828666